Termination w.r.t. Q proof of TRS/higher-order/AProVE

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

ap(ap(ff, x), x) → ap(ap(x, ap(ff, x)), ap(ap(cons, x), nil))

Q is empty.

↳ QTRS

Q restricted rewrite system:
The TRS R consists of the following rules:

ap(ap(ff, x), x) → ap(ap(x, ap(ff, x)), ap(ap(cons, x), nil))

Q is empty.